METHOD OF AFFILIATION TO A CLUSTER OF ELECTRONIC DEVICES COMMUNICATING VIA A WIRELESS NETWORK, ELECT

专利摘要:
The invention relates to a wireless communication network (R1, R2), particularly innovative and robust when said network, comprising a plurality of nodes, has a dynamic topology. An affiliation method (P100) implemented by a communicating electronic device (10) acting as a free node of said network can request, upon request, an affiliation procedure from a second device (10i) member a cluster (C1, C2). Affiliated with said cluster, a device (10) implementing said method (P100) can communicate with a third device acting as a cluster head in the same way as a member of said cluster. Such an invention makes it possible in particular to operate a container traceability system cooperating respectively with such devices on a storage area or a transport platform.
公开号:FR3029384A1
申请号:FR1461609
申请日:2014-11-27
公开日:2016-06-03
发明作者:Pascal Daragon；Natale Guzzo；Arulnambi Nandagoban；Nathalie Mitton
申请人:Inst Nat De Rech En Informatique Et Automatique；Traxens；
IPC主号:

专利说明:

[0001] The invention relates to a process for affiliation to a cluster of communicating electronic devices, said method being implemented. The invention also relates to a system comprising a plurality of devices implementing such an affiliation method.
[0002] As an example of a preferred but nonlimiting application, the invention is described by way of an example of application relating to the collection of quantities, such as, for example, a temperature, a humidity level, a luminous intensity, vibration frequency, shock, etc., in connection with the internal and / or external environments of containers of goods or merchandise or more generally containers. According to said example of application, said containers are agglomerated and / or stacked on a storage area or still roaming on a transport platform such as a container ship, a freight train or any other suitable transport platform. Each container cooperates with one of said communicating devices. The latter are responsible for collecting and routing said quantities through service messages to even devices acting as "heads of cluster" or "heads" in English terminology. One of the missions of a head is to implement a specific service. Such a service may, for example, consist in aggregating data collected by the communicating devices and in transmitting said data, after their aggregation, to a remote entity, by means of a long-range or long-distance link of the satellite link or link type. radiotelephone. The invention, however, can not be limited to this single application example. More generally, a "cluster head" device is responsible for implementing a given service in connection with data collected and forwarded by its peers, said given service being able to concern a supervision or a management of alarms, instead. or in addition to a communication with a remote entity. Many typologies or configurations of networks of communicating objects exist today. Figure 1 thus schematically shows two examples of wireless communication networks R1 and R2. Whatever the network operated, each communicating device, which is also generally called a "node" within such a network, implements a communication method enabling it to exchange data messages and / or service with a third or peer node. Thus, the network R1 situates forty communicating electronic devices respectively referenced in Figure 1, al to a8, bl to b8, cl to c8, dl to d8 and el to e8. For its part, the network R2 situates twenty-five communicating electronic devices, respectively referenced in Figure 1, fi to f5, gl to g5, hl to h5, it to i5 and jl to j5. That we operate a simple-hop network (or "single-hop network" according to English terminology), such as, for example, the network R2 described in connection with Figure 1, or multi- jumps (or "multi-hop network" in English terminology) such as, for example, the network R1 described in connection with Figure 1, a first node that we will call node "source", can prepare a service message, represented in FIG. 1 by a double-headed arrow, comprising data related to, by way of nonlimiting example, a quantity measured by a sensor cooperating with said first node, destined for a second "recipient" node.
[0003] According to a simple-hop network, the communication between the first and second nodes is direct. On the other hand, according to a multi-hop network, such a communication can be indirect. Thus, a message sent from a source node may be relayed by one or more "relaying or intermediate" nodes, whose respective roles are to retransmit said message from the source node so that it is ultimately routed to the destination node and received by the latter. The source nodes, which can communicate directly or indirectly with a head node, constitute "clusters" or "clusters", in English terminology, such as, for example, clusters Cl and C2 represented by a strapping in dashed line in Figure 1. The path according to which a service message from a first source node to a second destination node via one or more relay nodes is generally called "route". Thus, according to FIG. 1, a message sent from the node a4 to the node d2 will be relayed successively by the relay nodes b4 and c3. Communication within single-hop or multi-hop communication networks is generally carried out by radio. Such communication is generally of short range, that is to say of the order of a few meters to a few tens of meters, so that, step by step, the service messages are transmitted between the different nodes. When data is supposed to be sent to a server or more generally to a remote entity, a second communication mode is implemented, for example, by GSM ("Global System for Mobile Communications" in English terminology). -Saxonne) or GPRS ("General Racket Radio Service" according to English terminology), or even by a satellite link.
[0004] The exchanges between nodes, treatments or calculations implemented by the latter based on data exchanged, as well as the eventual and remote routing of data collected within a network or a cluster of communicating devices, are as many d actions consuming electricity. As indicated by a preferred example in FIG. 2, a node generally consists mainly of an electronic device 10 comprising a processing unit 11, for example in the form of a microcontroller cooperating with a data memory 12. optionally a program memory 14, said memories possibly being dissociated. The processing unit 11 cooperates with said memories 12 and 14 by means of internal communication buses. An electronic device 10 generally comprises one or more sensors for measuring a physical quantity in relation to the environment of the device 10. Such a sensor can measure the surrounding temperature, a humidity level or the presence and / or the absence of light. The device 10 further comprises first communication means 13 cooperating with the processing unit 11 and providing a wireless proximity communication with any other electronic device 10i located within communication range. It may also comprise second means of communication 16 of "long distance" type also cooperating with the processing unit 11. These second communication means allow such a device 10 to be able to transmit to a remote entity, for example an RS server. , data through messages MC distributed by an RR network exploiting eg GSM, GPRS or satellite technologies. To function, that is to say for the processing unit 11 to implement a method arising from the interpretation or execution, by said processing unit, of program instructions P stored in the memory of programs 14, the device 10 comprises a source of electrical energy 17, in the form of one or more batteries for example. The ability to communicate or simply to be able to operate from one node is directly related to the remaining and available energy capacity of said node. Some operators have sought to design networks or communication processes, implemented by nodes within a network or cluster, to globally preserve the electrical energy capacity of the network or cluster. Overall, a first approach consists in distributing the energy cost resulting from the exchanges between the nodes on all the said nodes of the network or the cluster. A second approach is to distribute the energy consumption resulting from the processing implemented on data collected, for example a long-distance transmission, on most nodes, thus sharing power consumption on a plurality of nodes. Thus, whether the contactless communication network is in a single-hop or multi-hop configuration, a node may be arbitrarily designated or promoted as a "head end" node or at least as a cluster head, or a node. head. In connection with Figure 1, a device acting as a head is represented by a circle drawn in thick lines. This is the node d2 for the network R1 and the node h3 for the network R2. The nodes d2 and h3 thus act as heads respectively of Cl and C2 clusters. In this way, the energy consumed, in particular for remotely transmitting data collected within a network, is shared over a plurality of nodes. Alternatively, the heads may be randomly designated, or more precisely may randomly self-designate respectively heads, provided that they have sufficient hardware and / or software to implement a specific service. By way of example, the "LEACH" method, as described in particular by the document titled "An ApplicationSpecific Protocol Architecture for Wireless Microsensor Networks" (W. Heinzelman, A. Chandrakasan, H. Balakrishnan - IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL 1, NO 4, OCT 2002), allows in a simple-jump network, randomly designate a node to become head. The other nodes belonging to the cluster of said head, nodes that we will name respectively "member" or "member" according to English terminology, address the head of 20 cluster, so head, their service messages. In connection with Figure 1, each member node is represented by a circle drawn in fine lines. Thus, within the network R2, the head h3 communicates directly with the nodes g2 to g4, h2 and h3 as well as with the nodes i2 to i4. The head collects said data transmitted from different member nodes, processes, aggregates or even consolidates them, and triggers, for example, a long-range transmission to a remote entity, such as an RS server described in connection with FIG. 2. According to this known technique, once a node has assumed the role of head, such a node can not provide such a role again before the expiry of a specified period. A new member node is then randomly designated head, thereby ensuring service continuity. So that a node, which we will call "free" or "loose" according to an English terminology, represented by a circle drawn in double line in conjunction with Figure 1, can "adhere" to a head and thus constitute a new cluster or join an existing cluster, such a free node, located within radio range of a promoted node or designated head, is arranged to receive an enrollment message MH emanating from said head, generally issued in the form of an undifferentiated transmission ( also known as "broadcast") of MH enlistment messages to any node within radio range of the head. FIG. 1 allows, through the network R2, to describe the resultant of a transmission of an MH message transmitted from the node h3, designated to act as a head, MH message transmitted in a short-range broadcast mode to nodes located within communication range, in this case, the nodes g2 to g4, h2 and h4, as well as the nodes i2 to i4, initially free nodes, like the other nodes, such as, non-exhaustively, the nodes fi to f5, represented by circles in double lines in FIG. 1. On receiving such an enrollment message MH, a free node, for example the node h4, updates its data memory, said memory cooperating with its processing unit to record the coordinates or the value of the head identifier, ie the identifier of the node h3 in conjunction with FIG. 1. The device h4, previously free, becomes a member of the cluster C2, represented by a circle in fine line. The device h3, acting as head, becomes the recipient of any MS service message comprising data collected by the new member device h4 C2 cluster as the other member devices of said cluster, the nodes g2, g3, g4, i2, i3 and i4. Thus, said nodes g2 to g4, h2 and h4, as well as the nodes i2 to i4, previously free nodes, become member nodes, appearing in circles drawn in single line in Figure 1. The transmission of the message MH by the node h3 is limited in scope. Also nodes, located out of reach, do not receive the message MH as an intelligible message, or do not receive it at all. The network R2 is of simple-hop type, the nodes being out of range of h3, such that the nodes fi to f5, gl, g5, h1, h5, h1, i5 or again the nodes j1 to j5 remain free nodes. , represented by circles drawn in double lines. Cluster C2 has only node h3, acting as a head, and the member nodes, that is, having accepted the enlistment of head h3. A transposition of the LEACH teaching in the context of a multi-hop network, such as the network R1 described in connection with FIG. 1, could suggest that the nodes, becoming members of a cluster comprising a node acting as a node. that head, record, within their respective data memories, the route, that is to say, the value of the node identifier acting as head and at least the value of the identifier of the node having relayed the enrollment message of said head, or alternatively, the respective values of the identifiers of the intermediate or relay nodes separating it from said head. Thus, for example, the node c2 stores the value of the identifier of the head d2, having received directly an enrollment message MH of said node d2. The node b2 records, in addition to the value of the identifier of the node d2, the value of that of the node c2 relayed the enrollment message MH of d2 in favor of the node b2. Such an approach allows in theory, or at least in a perfect mode of application, to preserve the overall energy resources of a communication network comprising a plurality of communicating nodes. In practice or in reality, and particularly according to fields of application OR of operating such a communication network in connection with the transport of containers cooperating with communicating electronic devices, such a solution remains irrelevant, at least not very effective. Indeed, let us take as an example of a preferred but nonlimiting application, the operation of a wireless communication network whose nodes record, collect and transmit measurements in connection with a plurality of containers, such as containers of goods or merchandise. Imagine that each container is associated with a communicating electronic device implementing a communication method such as LEACH or a multi-hop type equivalent. According to this hypothesis, each communicating electronic device associated with a container acts as a node within the wireless network, such as the network R2 described in connection with FIG. 1. Imagine that the mode of communication between nodes is done by radio . In addition to the fact that a LEACH-type communication method imposes a single-hop approach, thus imposing that each node may be able to communicate directly with a head, the relative arrangement of the containers, for example on a ship, on a storage area or on any road or rail transport platform, creates an application context, such as a designated node head might not be or no longer be able to fulfill its mission, for example by transmitting aggregated data to destination of a remote unit, simply because of its positioning in a stack of containers for example. Indeed, there are many obstacles constituted by a transport platform and / or a storage space, because of partitioning or partial confinement imposed by the container reception structure, or by the interactions generated mutually by the containers themselves. themselves, whose stacking can lead to degradation, or even a loss of capacity to transmit data by long distance from a head. The risk of a loss of data, slow data routing, but also unnecessary and irrelevant energy expenditure to "animate" a cluster whose head would not be able to effectively perform its function or service, is very great. This risk is even more so in the event that random elections of consecutive heads result in "choices" not very successful. To solve such drawbacks, the company TRAXENS, associated with the French National Institute of Research in Computer Science and Automation, has designed a wireless communication network, particularly innovative and powerful, regardless of the relative arrangement of the nodes and what whatever the applicative or operating framework of said network, whether this one is of simple-hop or multi-hop type. Such a network makes it possible to optimize the overall capacity of the network to provide a service determined from data collected by the different nodes. It relies mainly on a method of joining a cluster of communicating devices according heads election modalities, if and only if they are in real capacities to assume their role of head, for example to issue data according to a long distance communication mode. Each node implementing such a method can decide to act as head, from the moment when said node knows that it is in a position to effectively perform its role. Moreover, any free node may decide to adhere or not to a cluster of nodes, said cluster comprising said head, advantageously self-designated. Such an innovation brings many advantages among which, we can mention that it is possible to: - appropriately share the energy expenditure on the nodes of the network, thus extending the capacity to render a service of said network in an unequaled way compared to the previously mentioned solutions; designing a node network that is automatically adaptable and functional as changes in relative positions between the nodes or changes in the operating conditions of said nodes, for example during the handling, storage or transport of containers each associated with a electronic device; give priority to the robustness of the service, for example long-distance data transmission, by giving each node the opportunity to determine its role within the network and to refer at each moment to the best head according to the service considered, while minimizing conflict or cluster modification in concomitant elections of a plurality of heads within radio range of common nodes. Although proposing a significant advance, such a solution presents, like the competing solutions mentioned above, certain limits or disadvantages, especially if such a communication network is exploited in an application context for which the topology of said network is particularly changing, that is to say, for which new nodes wish to join the network or for which, nodes move with regard to others, thus becoming radio range or on the contrary, becoming out of range of radio communication of a head or a member of a cluster to which they had respectively previously adhered. In fact, whatever the communication network 35 chosen, the routes or topologies, that is to say the constitution or the destruction of clusters, of said network are not updated with sufficient regularity or with sufficient frequency to take into account the dynamics of said network. With the help of known solutions, if such updates were carried out at a high frequency, the number of enlistment, cluster destruction or service messages would be increased tenfold, so that the main objective of preserving the energy consumption of the nodes of the network can not be maintained.
[0005] The invention makes it possible to meet the great majority of the disadvantages raised by the known solutions. By constituting a particularly innovative and robust wireless communication network, even when nodes constituting said network are mobile relative to one another or when the topology of said network is fluctuating, any free node, that is to say say no head of cluster or no member of a cluster, can request, on demand, a procedure of affiliation to a member of a cluster. Such an affiliation procedure may result from an adaptation of the various networks described above, in particular those illustrated in connection with FIGS. 1 or 2. The requests for affiliation of free nodes are represented by arrows in double lines. In the present case, these are the nodes c5 or i5 which respectively request an affiliation with the nodes c4 and i4, respective members of the clusters C1 and C2 whose heads are the nodes d2 for the network R1 and h3 for the network R2. FIG. 1 also illustrates a variant according to the invention according to which a free node, such as node c8, can in turn send an affiliation request to a node, in this case node c5 according to the Figure 1, previously affiliated with the Cl cluster whose cluster head is the node d2.
[0006] Each node implementing a method according to the invention can thus, at its request and independently of the heads enlistment policy, request an affiliation with a member of a cluster and thus transmit service messages to destination of a head, via in particular the member node having accepted the affiliation procedure, although said head is out of radio reach of said node requesting an affiliation to transmit an enrollment message. The invention thus makes it possible to extend clusters formed after an enrollment procedure, or even to transform a simple hop-type network into a "pseudo multi-hop network", the member node having accepted an application for affiliation operating as the relay node of the affiliated node for the transmission of service messages. To this end, the invention relates to a method of affiliation to a cluster comprising a plurality of communicating electronic devices. Such a method is implemented by a processing unit of a first communicating electronic device further comprising a data memory, first communication means ensuring a wireless proximity communication with any other communicating electronic device located within communication range. , said memory and said communication means cooperating with said processing unit, the data memory storing the value of an identifier dedicated to the first communicating electronic device and a register arranged to include the current value of an identifier of an electronic device communicating acting as a cluster head. To extend said cluster, which has been constituted for example after a previous enrollment procedure, an affiliation method according to the invention comprises: a step for receiving an affiliation request message drawn up and issued by a second communicating electronic device requesting an affiliation to a cluster, said affiliation request message comprising the value of the identifier of said second device requesting an affiliation; a step for decoding said affiliation request message and for deducing therefrom the value of said identifier of said second device requesting an affiliation; - a step to develop a message acknowledging the affiliation request to encode within said message: i. the value of the identifier of the first device as the source device identifier of said message acknowledging receipt of the affiliation request, ii. the value of the identifier of the second device requesting affiliation as the recipient device identifier of said message acknowledging receipt of the affiliation request, iii. the current value of the identifier of a third communicating electronic device acting as a cluster head, said value being read in the register; - a step for triggering transmission by the first communication means of the message acknowledging receipt of the application for affiliation.
[0007] In the case where it is possible to quantify an ability to provide a service determined by an electronic device, the step of developing a message acknowledging the affiliation request may further include encoding a value describing a capability of the third device. communicating electronics acting as a cluster head to provide a service. Said value can be advantageously recorded in the register furthermore memorizing the current value of the identifier of said third communicating electronic device acting as a cluster head.
[0008] In order for the first communicating electronic device to be able to give a favorable and relevant response to an affiliation request, the invention provides that the step for triggering the transmission, by the first communication means, of the acknowledging message the affiliation request is advantageously accomplished only if the data memory stores a register comprising a current value of an identifier of a communicating electronic device acting as a cluster head.
[0009] The invention also provides that the first communicating electronic device may, in turn, be able to request an affiliation to a cluster. Such a situation may, for example, result from a dissolution of the cluster of which said first device was a member. For this purpose, an affiliation method according to the invention may comprise: a step for elaborating an affiliation request message consisting in encoding the value of the identifier of the first device as an identifier of a device requesting a cluster membership; a step for triggering the transmission by the first means of communication of said affiliation request message; a step for receiving by the communication means a message developed and issued by a fourth device acknowledging the affiliation request message; a step, implemented if and only if said message, acknowledging the affiliation request message, is received before the expiry of a maximum waiting time determined from the transmission of said request message d affiliation, for decoding said message acknowledging receipt of the affiliation request message and inferring: i. the value of the identifier of the recipient device of said message acknowledging receipt of an affiliation request; ii. the value of the identifier of a fifth communicating electronic device acting as a cluster head to which the fourth source device of said message acknowledging an affiliation request belongs; a step, implemented if and only if said value deduced from the identifier of the destination device is equal to that of the value of the identifier of the first device requesting an affiliation, to register in the register the value deduced from the an identifier of the fifth communicating electronic device acting as a cluster head, as a current device identifier value acting as a cluster head. Advantageously, according to this embodiment: the step for decoding the message acknowledging the affiliation request message may further consist in deducing from said message the value of the identifier of the fourth communicating source electronic device of said message; the step of updating the register may also consist in recording therein said identifier value deduced as identifier of a communicating electronic device on an ascending road separating the first communicating electronic device requesting an affiliation of the fifth device communicating electronics acting as a cluster head. To convey information, for example related to the environment of the first communicating electronic device, to a device acting as a cluster head, a method according to the invention may comprise a step for developing and triggering, by the first communication means, the transmission of a service message to a communicating electronic device whose identifier value is stored as the current identifier value of a communicating electronic device acting as a head cluster, by the register. According to this advantageous variant, the invention provides that the first device "affiliated" to a cluster can verify the continuity of its affiliation prior to the issuance of a service message. For this, a method according to the invention may comprise: a preliminary step for developing and transmitting, by the first communication means, an affiliation verification message, said message encoding: i. the value of the identifier of the fourth communicating electronic device as identifier of the communicating electronic device to which the affiliation verification message is addressed; ii. the value of the identifier of the first device as an identifier of the communicating electronic device source of said affiliation verification message; a step, implemented if and only if a message acknowledging receipt of said affiliation verification message is received before the expiry of a maximum waiting period determined from the issue of the affiliation verification message, to decode said acknowledging message and to deduce: i. the value of the identifier of the recipient device of said message acknowledging the affiliation verification message; ii. the value of the identifier of the source device of said message acknowledging the affiliation verification message. According to this advantageous embodiment, the steps for developing and triggering the transmission of a service message are advantageously implemented only if: the value deduced from the identifier of the recipient device of the message acknowledging the message of Affiliation verification is equal to that of the identifier of the first communicating electronic device; the value deduced from the identifier of the source device of said message acknowledging the affiliation verification message is equal to that of the identifier of the fourth communicating electronic device. According to a second object, in particular to adapt a communicating electronic device, the invention also relates to a computer program comprising a plurality of program instructions which, when they are: - previously recorded in a program memory of such a electronic device further comprising a processing unit, first communication means ensuring a wireless proximity communication with any other electronic device located within communication range, a data memory recording the value of an identifier dedicated to the device and a register to include the current value of an identifier of a device acting as a cluster head, said memories and said first communication means cooperating with said processing unit; - executed or interpreted by said processing unit, causes the implementation of an affiliation method as provided by the invention. According to a third object, the invention furthermore relates to an electronic device comprising a processing unit, a data memory, a program memory, first communication means ensuring wireless proximity communication with any other electronic device within range. communication memories, said memories and first communication means cooperating with said processing unit, the data memory comprising the value of an identifier dedicated to the device and a register for comprising the current value of an identifier of a device acting as a than cluster head. So that said device can implement an affiliation method according to the invention, it advantageously comprises in the program memory, the instructions of a program as mentioned above. The invention also provides a system comprising a plurality of such communicating electronic devices. According to an example of a preferred and nonlimiting application, such a system may advantageously comprise a plurality of containers of goods, of solid, fluid or liquid goods, said containers cooperating respectively with the communicating electronic devices, the latter each comprising a sensor cooperating with the processing unit for measuring and collecting a quantity related to the internal and / or external environments of said containers. Other features and advantages will appear more clearly on reading the following description relating to an exemplary embodiment given for information only and not limiting and to the examination of the figures which accompany it, among which: FIG. already described, illustrates two examples of configurations of a wireless communication network, respectively single-hop or multi-hop; FIG. 2, partially already described, presents the functional architecture of a communicating electronic device according to the prior art and according to the invention when the latter is adapted to implement a method of affiliation to a cluster of communicating devices. with peers via a wireless communication network, said method being in accordance with the invention; FIG. 3 presents a functional description of an affiliation method according to the invention.
[0010] A communicating electronic device according to the invention is similar to a known device 10, such as that described previously with reference to FIG. 2. As such, a communicating electronic device according to the invention comprises a processing unit 11, consisting of one or more microcontrollers responsible for carrying out processing on data in particular. Said data are advantageously, all or part, recorded on one or more data memories 12, generally electrically erasable and writable. The memory 12 may advantageously comprise a non-erasable section, physically isolated or simply arranged so that access to write or erase is prohibited, or still requiring the satisfaction of an authentication procedure. Such an advantageous section of the memory 12, whose access to modification is restricted, makes it possible to record in particular the value of an identifier ID dedicated to the communicating electronic device.
[0011] Advantageously but non-obligatorily, a device 10 may further comprise one or more program memories 14 for recording one or more programs P, or more generally one or more sets of program instructions, said program instructions being intelligible to the user. processing unit 11. The execution or interpretation of said instructions by said processing unit causes the implementation of a method of data processing or operation of the device 10. The latter also comprises first communication means 13 ensuring wireless proximity communication with any other electronic device, such as the device 10i, provided that the latter is within communication range. Through said first communication means 13, the device 10, or more precisely its processing unit 11, can transmit and / or receive messages to or from third devices positioned within communication range. Such messages can be of any kind. Among various types of messages, we can mention, in a non-exhaustive manner, MS data messages in connection with a particular service S, MH enrollment messages, MR cluster destruction messages. Some communicating devices can benefit from the electromagnetic field created by the network, to draw sufficient electrical energy to ensure their operation, if only for a brief period of time. However, in order to ensure continuous operation and / or to implement processes requiring more energy, a communicating electronic device 10 according to the invention may advantageously comprise a source of clean electrical energy 17, in particular supplying the processing unit 11, even any other element constituting said device that would require it. Such a source 17 generally consists of a battery or a plurality of batteries. Depending on the privileged application context in particular with the container tracking, although this particular context can not limit the field of exploitation of the invention, a communicating electronic device 10 may comprise one or more sensors 15 cooperating with the control unit. 11. Such a sensor can measure one or more quantities related to the internal and / or external environments of said containers and produce data. By way of example, as illustrated in FIG. 2, a sensor 15 can measure the temperature and / or the humidity prevailing within a container, the darkness or the loss of darkness within the enclosure attesting an unexpected opening of the container, or even shocks. If necessary, the sensor or sensors may cooperate with the processing unit of a device via probes or conductive sheets, especially in the case where a device 10 would be affixed against the outer wall of a container while one wishes to supervise, by means of said device 10, the interior environment of said container. Such a device 10 may furthermore comprise a clock enabling it to time stamp the collected measurements, said clock not being represented in FIG. 2. According to the service or services that it is desired to operate using communicating electronic devices according to the invention may include additional and optional means. As a preferred example, a service may consist of: collecting data from the nodes of a network of communicating electronic devices according to the invention, for example in relation to quantities measured by said nodes; aggregating said collected data with a plurality of nodes, and then constructing MC messages encoding consolidated service data to a remote entity, such as an RS server.
[0012] In order to transmit such messages MC, a device 10 advantageously comprises second long distance communication means 16 cooperating with the processing unit 11. Such communication can be carried out via an RR network, by GPRS or satellite channels, or by any other means adapted communication channel. The various internal components of the electronic device cooperate with the processing unit 11, advantageously by wired buses or by couplings. The device 10 may comprise a housing housing said components, said housing advantageously comprising fixing means for affixing the device 10 on a support which it is desired to follow, in this case a container according to the preferred application example. To implement the invention, it is required to act on the operation of the processing unit, more specifically on a communication method implemented by said processing unit. Such a method will be described in connection with Figure 3 later. A preferred mode of adaptation consists in providing a program, or more generally mutually arranged program instructions, for implementing said method when executing or interpreting said program instructions by the processing unit. Advantageously, said program P is loaded into the program memory 15 during assembly of said device or, by downloading said program within the memory 15 after said assembly phase of the device.
[0013] The invention lies mainly in the implementation of a simple-hop network, for example a LEACH network, or advantageously multi-hop network, for which each node consists of a communicating electronic device such as the device 10 previously described.
[0014] A node of such a network is generally adapted or arranged to implement a method of adhesion to a cluster of devices. The data memory 12 comprises, in addition to the value of the identifier ID dedicated to the communicating electronic device, a register RH intended to include the current value IDHc of an identifier of a communicating electronic device acting as a head, such as the nodes d2 or h3 according to Figure 1. When a device chooses to adhere to a cluster of which one of the nodes acts as head, this adhesion 35 is generally exclusive. In other words, a node can not be a member of distinct clusters, that is to say each having separate heads nodes, for the same service. A node adhering to a cluster chooses the best head for said service. However, a node may also be attached to a plurality of heads, if said heads are assigned to the implementation of separate services, such as, for example, a head for long distance data transmission (Si service) and a second head head for the implementation of an alarm management service (service Sj) on a site. In this respect, like the LEACH solution, previously presented, clusters of communicating electronic devices, such as clusters Cl and C2 of the networks R1 and R2 described with reference to FIG. 1, comprise a device acting as a head, such as the nodes d2 or h3 described in connection with Figure 1. The other devices act as members of said cluster, such as, but not limited to, the nodes c2 or i3 described in connection with Figure 1. The role of a member is mainly to collect information, such as measurements of environmental variables, to translate them into data and then to encode the data in the form of an MS service message to a head. ability to provide the specified service. This head recognizes said MS service messages and then implements the determined service S. For example, such a service may consist of aggregating the data transmitted to the head from several members via MS messages and then implementing a long distance transmission said aggregated or even consolidated data in the form of messages MC to a remote entity RS. An MS service message, addressed from a cluster member to a head, is structured to include: information characterizing the message type (MS, MH, MR, etc.); the value of an identifier of the source node, moreover generally a member node; the value of an identifier of the destination node, in this case a head, or even an identifier of an intermediate or relay node in the case of a multi-hop network, data, for example in relation to quantities measured by a sensor of the device, - possibly a redundancy code or a cryptogram or other control information for a node receiving such a service message to decode, operate or relay. An MS message, like any other message circulating within the network, can trigger MACK acknowledgment messages, transmitted by the recipient of the message to the source node. At the end of a given period or "timeout" according to English terminology, if no MACK message is received, a new transmission of the message MS is triggered, and this for a limited number of iterations to the the source node considers that the "route" or the communication with the destination node is not available. Such a source node may decide to abandon the cluster and recover a free node status, or to seek to adhere to another cluster.
[0015] The adhesion of a free node to a node acting as head is close to that implemented according to the LEACH solution. However, the modalities of electing a head and the terms of membership of a free node to become a member of a cluster can be very different, as for example the company TRAXENS, associated with the French National Institute Research in Computer Science and Automation (INRIA). According to this variant, only nodes in actual capacity to provide a specific service are able to self-designate head. For their part, the other nodes are free to referee a competition of heads and to choose the head which appears the best candidate to implement the service to which they contribute. Whatever the mode of election of heads, a first mode of design of communicating devices may be to continuously maintain the latter in listening to radio communication frequencies to test the presence of messages from even devices. Such an approach can lead to a significant energy expenditure and affect the autonomy of the entire network.
[0016] A second approach, known in the English terminology Wake On Radio (WOR), consists of plunging the nodes into relative sleep during the vast majority of the time of their respective operations. Radio communication is notably disabled because it consumes a lot of electricity. Such nodes may, however, continue to implement low-energy internal treatments. Cyclically, such nodes awake to listen to any messages from peers or to send enlisting messages, service, etc., in their turn. FIG. 3 illustrates a communication method P100 comprising a cluster affiliation request procedure implemented by a first device according to the invention, such as, for example, a device 10 described in connection with FIG. 2. Such an affiliation procedure on demand allows a free node, such as for example the node c5 or the node i5, to take the initiative of a phase of discovery of a node member or head in its vicinity . Such a situation arises, for example, from the appearance of such a free node while a cluster has already been formed. It can also result from the destruction of a cluster whose head node and its member nodes become free while said member nodes need to send service messages to a new head. The situation can still result from an excessive distance, or a non-optimal positioning, between a suitable node and candidate to become a member and a head, said candidate node being out of radio range or too far in number of jumps for that an enrollment message emanating from said head is not conveyed to him. According to the known techniques, it is necessary for a node to take the initiative to self-elect or to be designated head, and that it triggers an enrollment procedure, so that free nodes can recover a status of member node. Time and valuable energy can be lost in the delivery of service messages.
[0017] The invention thus allows a free node to request an attachment to a cluster, and therefore indirectly to a head, by an affiliation procedure on demand. Let us first describe a treatment 210 implemented by a communicating electronic device 10 according to the invention, implementing a method P100. Such treatment consists in triggering an affiliation procedure.
[0018] The latter may advantageously comprise a prior step 219 of awakening the device 10 if it implements a technique Wake On Radio (WOR) for example. Said processing 210 comprises a step 211 for preparing a MAR membership request message. Such a message comprises and / or encodes, as first information MAR-1, the value of the identifier IDa of the device 10. Said identifier is advantageously recorded in a unique manner in the storage means 12 of said device 10. The processing 210 comprises in in addition to a step 212 for triggering the transmission of said MAR membership request message to any neighboring node, by the first communication means 13. The transmission power of such an MAR message can be predetermined and fixed. As a variant, said transmission power may be variable in order, for example, to be reduced according to the remaining energy capacity of the internal power supply means 17 of the device implementing said method P100. Said transmission power can also be progressive, the transmission step 212 being iterative if the request for affiliation remains unanswered as we will see later. In any case, the step 212 for triggering the transmission of an affiliation request message MAR is followed by a step 213 waiting to receive a MAA message, acknowledging receipt of said request message. MAR affiliation, issued by a neighboring node member or head of a cluster. A maximum waiting time in step 213 of such an MAA message can be parameterized or determined so that at the end of a given time, the device 10 implementing said method P100 considers (symbolized situation by the link referenced 213-n in Figure 3) that it is too lonely or badly positioned to join a cluster. The treatment 210 is thus interrupted in step 220. Such a step 220 may further consist in plunging the device into sleep or standby during a time period determined according to a WOR technique for example. When during step 213, a MAA acknowledgment message is received by the means 13 (situation symbolized by the link referenced 213-y in FIG. 3), the processing 210 includes a step 214 for decoding said MAA message. Indeed, the invention provides that such a MAA message includes or encodes in particular a first information M7A-1 consisting of the value of the identifier IDm of the source device of said MAA message. The latter also encodes the value of the identifier IDa of the source device of the affiliation request message, as the device identifier recipient of the MAA message, in the form of information referenced MAA-2 on the example. non-limiting manner described in connection with Figure 3. Said MAA message can further advantageously encode the ascending route Ru, in the form of information referenced M7A-3 in Figure 3, with the values of the identifiers of the member nodes and / or MH enrollment and / or MS service message relayers between the source node of said MAA message and the head of the cluster of which it is a part. Such a MAA-3 field advantageously comprises at least the value of the identifier of the relay node belonging to the said route which is the closest to the source device of the MAA message and the identifier IDH of the head. A MAT-4 field may further, or alternatively, encode the downstream path separating the source node from the MAA message of the requesting node. Advantageously, a MAA message may furthermore comprise, in a variant or in addition to the MAA-3 and / or MAA-4 fields, MAA-5 information reflecting the number of TTL hops required for the upward route Ru, or even the downward Rd route. A MAA message may advantageously comprise or encode fields M7A-6, MAA-7, in connection for example with values of current capacities CHc1, CHc2, of the head to ensure such or such service, or even any other additional information IMa. , in the form of a field referenced MAA-8 in conjunction with FIG. 3. The step 214 thus consists in deducing from the MAA message all the relevant and encoded information in said message. When step 214 confirms that the identifier value encoded in the field M7A-2 corresponds to the value of the identifier IDa of the device requesting the affiliation request, the message MA A is considered as a message acknowledging receipt of said application for affiliation. The processing 210 then comprises a step 215, subsequent to the step 214, of recording within the storage means 12 of the device, information deduced from said MAA message, in particular the value of the identifier IDH of the head node, or even that the identifier of the first node on the ascending route Ru from the node requesting affiliation. Such an action may advantageously consist in the updating of a register RH, within said storage means 12. The value of the identifier IDH is notably inscribed as a current value IDHc within the register RH. The device 10 then becomes an "affiliated" node to the cluster of the head node. The method P100 may then comprise and trigger the implementation of a processing 120 consisting of sending an MS service message to the head, in particular via the node having responded favorably to the application for affiliation, that is to say say via the source device of the MAA message. We have seen previously that the invention provides that the transmission power of a MAR membership request message can be progressive. The objective sought by this embodiment is to preserve the energy resources of the means 17 of a device 10 according to the invention. To implement such a progressivity, the transmission power of a MAR message is first set by the processing unit to transmit, according to a broadcasting type technique, short range said MAR message. A first iteration of step 212 thus consists in setting the transmission power to a floor value Pmin. At the end of the maximum waiting time provided in step 213, if no MAA message acknowledging receipt of the affiliation request is received (situation symbolized by the link referenced 213-n in FIG. 3), step 220 is not automatically implemented as for the previous embodiment. Instead, the processing 210 consists in triggering a new iteration of the step 212 and thus emitting the MAR message again with an increased transmission power Pmin +. This increase is carried out by the processing unit implementing the processing 210 in a step 217, for example according to a given multiplicative factor or a determined incremental step applied to the floor power Pmin. If, at the end of the maximum duration provided in step 213, no MAA message is received (situation symbolized by the link referenced 213-n in FIG. 3), the processing 210 may trigger a new iteration of the message. step 212. One or more iterations of the steps 217 and 212 can thus succeed each other as long as no MAA message is received as long as the power Pmin + remains lower than a maximum power Pmax for transmitting a message MAR (situation symbolized by the link referenced 218-n in Figure 3). Said iterations cease as soon as in 218 the maximum transmission power of a message MAR is reached. In this case, the processing 210 stops at 220. The invention provides a variant or an addition to the previously described embodiment in connection with a transmission power of a progressive MAR message. According to this new embodiment, the step 211 of elaborating a message MAR consists in integrating into said message a field specifying the number of allowed jumps, which we will note hereinafter TTL, separating a node requiring an affiliation of a node. member or head of a cluster. When said number of jumps is greater than one, the invention provides that a MAR membership request message can be relayed by a node that does not act as a member or head of a cluster. We will see later how such a function is made possible by describing a processing 200 of the method P100 according to the invention, a process triggered upon receipt of an affiliation request message MAR. According to this embodiment, the steps 211 and 212, respectively for generating and triggering the transmission of an MAR message followed by the waiting step 213 of the reception of a MAA message, are jointly iterated by incrementing or multiplying in step 217 said number of allowed jumps, at the end of each unsuccessful iteration, that is to say as long as no MAA message is received at step 213 (situation symbolized by the link referenced 213-n in Figure 3). When said number of TTL jumps reaches a predetermined ceiling, a situation symbolized by the link referenced 218-y in FIG. 3, and that step 213 has not made it possible to receive a message, the processing 210 triggers step 220 and stops. The device implementing said method P100 remains a free node. By way of nonlimiting example, the minimum value of TTL at the first iteration of step 211 may be one, meaning that no relay of the MAR message is authorized by the applicant of an affiliation. At each iteration, this number can be multiplied by a given multiplicative factor, for example by a value of two, until said value of TTL reaches a ceiling value equal to 16. As a variant, the value of TTL can be incremented at each iteration of a step, for example equal to one or any other non-zero integer. The invention further provides that the maximum waiting time provided in step 213 can also be progressive and revised at each iteration in step 217. Let us now study several embodiments of a processing 200 implemented. by the processing unit 11 of a device according to the invention, such as the device 10 described in connection with FIG. 2.
[0019] Such processing 200 is described in conjunction with FIG. 3. It is triggered, when implementing a P100 affiliation method, in response to the receipt of a MAR affiliation request message sent by a subscriber. third-party device requiring cluster membership. Such a processing 200 according to the invention thus comprises a first step 201 for receiving a MAR membership request message developed and transmitted by a communicating electronic device, such as the node c5 or the node i5, described in connection with FIG. 2. Such a MAR message includes or encodes in particular the value of the identifier IDa of the device requiring a membership to a cluster, for example within a field MAR-1. The method P100 also comprises a step 202 for decoding said MAR affiliation request message and thus deducing in particular said value of the identifier IDa. The invention mainly provides two situations, respectively symbolized by the links referenced 203-a and 203-b in FIG. 3, when a device according to the invention receives in 201 a MAR affiliation request message issued by a second device according to the invention and requiring an affiliation to a cluster: the device receiving said MAR message is a member node or head of a cluster; such a device, for example the node i4, as described in connection with FIGS. 1 and 2, receiving a message MAR sent from the node i5, comprises a register RH encoding a current value IDHc of an identifier IDH, in species, the identifier of node h3 acting as the head node of cluster C2; the device receiving said MAR message is a free node; such a device, for example the node c5, as described in connection with FIGS. 1 and 2, receiving a message MAR sent by the node c8, does not include a register RH encoding a current value IDHc equal to that of an identifier IDH of a node, such as d2, acting as a head node; alternatively, such a free node may include an RH register encoding a determined value indicating that the node is not a member or head of a cluster.
[0020] In the first situation (link 203-a in FIG. 3), the processing 200 comprises a step 204 for preparing a MAA message acknowledging the application for affiliation of the device requiring an affiliation. Such a step 204 consists in encoding within the MAA message (MA-2 field according to the example of FIG. 3) the value of the identifier IDa of the device which is at the origin of the affiliation request as a identifier of the recipient device of the MAA message. As mentioned above, such a step 204 furthermore consists in encoding (field MA-1 according to the example of FIG. 3) the value of the identifier IDm of the device implementing the processing 200 and acting as a member node or head of a cluster. Step 204 may furthermore encode (field MA-3 according to the example of FIG. 3) the ascending route Ru, that is to say the values of the identifiers of nodes separating the node, thus preparing to transmit the MAA message, the head of the cluster of which it is part, said route including the value of the identifier IDH said head. Step 204 may further consist in encoding (fields MAA-5, MAA-6 according to the example of FIG. 3) additional information or values describing one or more capacities CHc1, CHc2 of the head to provide such or such service. Step 204 can furthermore encode the downlink Rd separating the source node from the MAA message of the node requesting the affiliation (field M7A-4 according to the example of FIG. 3), or even additional information (MAA-8 field). according to the example of Figure 3). The processing 200 then comprises a step 205 for triggering the transmission of said MAA message by the communication means 13 of the device 10 implementing said processing 200. In the case where such a device, receiving an affiliation request message MAR is a free node (second situation symbolized by the link 203-b in Figure 3), the invention provides that advantageously, according to a first embodiment, such a device remains silent (step 207). According to a second embodiment, in particular when the step 211 of a processing 210, according to the invention and previously described, consists of producing a message MAR encoding a field specifying a number of jumps or relay allowed, the invention provides that the processing 200 allows to relay an MAR membership request message via one or more nodes that do not act as members or heads of a cluster when receiving said MAR message. According to this embodiment, the processing 200 includes a step 206 for decrementing by a predefined step, for example by one unit, the TTL value deduced or decoded at the step 202. The step 206 further consists in comparing the decremented value of the TTL field at a floor value, as a non-limiting example, a zero value. If said decremented value reaches said floor value (situation symbolized by the link 206-n in FIG. 3), the processing 200 stops at 207 and the device implementing said processing remains silent in response to the receipt of the message MAR. In the opposite case (situation symbolized by the link 206-y in FIG. 3), the processing 200 comprises a step 208 for encoding again the information deduced in 202 of the received MAR message, except for the TTL field which is updated and takes the TTL value decremented in 206. Step 208 furthermore consists in triggering the transmission of said re-encoded MAR message to the vicinity of the device, like an even device which would implement a processing 210 for develop and issue a MAR membership request message for his own account. Thus, the relaying device transmits an application for affiliation on behalf of others. Step 208 then advantageously consists in recording, in addition, in the storage means the value of the IDa ID of the node for which it relays the MAR message. A device according to the invention can also relay any MAA message acknowledging a message MAR, said MAA message having been previously prepared and issued by a third party device acting as head or member of a cluster by the implementation in particular of steps 204 and 205 of a treatment 200 according to the invention. For this, the invention provides that the processing 200 implemented by a message relay device MAA comprises a step 209 for decoding a MAA message. This step consists in particular in determining the value of the identifier IDa of the recipient device of the MAA message, that is to say the identifier of the device having sent the original MAR message. If said identifier value corresponds to that of the identifier recorded at 208, then an iteration of step 205 to trigger the sending of a message acknowledging the receipt of an affiliation request is implemented in order to propagate said MAA message. Thus, step by step, via one or more relaying devices according to the invention, the MAA message sent from a member or head of a cluster can be routed to the source device of the original affiliation request. By implementing a method of affiliation P100, as described above, a device, such as the device 10 described by way of nonlimiting example in connection with FIG. 2, can also become a node affiliated with a cluster. In connection with FIG. 3, to achieve this, such a device implements a processing 210 for: - firstly, elaborating and transmitting a MAR message for a cluster affiliation request and then, - in response to said application for affiliation, take into consideration a MAA message acknowledging receipt of said affiliation request, such a MAA message having been developed by a third party device or head of a cluster, said third party device also implementing a P100 method according to the invention, more specifically a processing 200 and transmitted to the device requiring affiliation, possibly via one or more free devices and / or affiliated. As mentioned above with reference to FIGS. 1 and 2, the implementation of a simple jump network R2 or a multi-hop network R 1 according to the invention has the main objective of collecting information related to the In fact, each communicating device 10 is advantageously affixed against the wall of a container. The processing unit 11 of each communicating device 10, acting according to the context as a member or, thanks to the invention acting as an affiliated node, is adapted to trigger the development and transmission of encoding MS service messages. environmental information of the device. The processing unit 11 of a device 10 acting as head is adapted to receive such service messages MS, deduce said environmental information from one or more members or affiliates and implement a service, for example long-range transmission of MC messages over a GPRS network or equivalent to a remote RS server. Elaborating an MS service message by a member device of a single-hop or multi-hop network from measurements delivered by one or more sensors is in principle known. On the other hand, the development and transmission of an MS service message by an affiliated device, within the meaning of the invention, intended for a head, requires an innovative processing 120 for developing and transmitting data. such an MS message. FIG. 3 describes an exemplary embodiment of such a processing 120. The latter conventionally comprises, that is to say, like that implemented by a member node according to the prior art, a step 123a. to develop an MS service message and a step for transmitting said message to the device acting as a head for a determined service S. Such a step 123 is implemented following a step 121 prior to, for example, collecting from a sensor 15 a measurement related to the temperature prevailing within a container against which the device 10 implementing the P100 process is affixed. Such a step 123 is also conditioned on the presence (test symbolized by step 122 in FIG. 3) of a register, such as the register RH written in the data memory 12 of a device 10 described in connection with FIG. FIG. 2, comprising the value of an identifier IDHc of a device or node acting as head (situation symbolized by the link 122-y in FIG. 3) signifying that the node is a member or affiliate of a cluster. In the opposite case (situation symbolized by the link 122-n in FIG. 3), the processing stops at 129 and no transmission of such a message is triggered. According to whether said register RH comprises a direct ascending route Ru, that is to say that only an identifier value IDHc of head is present in the register RH, or an indirect ascending route Ru, that is to say that said register RH further comprises a ID value ID 'of a relay member, the message MS is directly transmitted to said head or said relay member.
[0021] Moreover, such a transmission 123 of an MS service message can also be triggered by the receipt 121b of a service message MS emanating from a member of the same cluster and addressed to the device 10, which implements said P100 affiliation process and acts as a relay member. Following the receipt of such a service message from a member of the same cluster, step 121b may therefore include a step for receiving and decoding such an MS message, or even to temporarily store in the memory 12, the data contained in said decoded MS service message. The relay of said MS message can thus result in a retransmission of said message MS delayed time. Such a "conventional" treatment can not be implemented by a communicating device acting as a node affiliated with a cluster. It is indeed relevant that prior to the issuance of a service message, said device validates the continuity of its affiliation. Indeed, the cluster to which is affiliated said device may have been destroyed, for example, under the initiative of the head or following a change in the mutual configuration of the nodes. The processing 120 thus includes a test step 124 to determine whether the device is acting as a member node or affiliated node. This state can be determined for example by reading a Boolean status flag, the current value of which is stored in the data memory 12 of the device or by any other technique. Such a status indicator can thus take alternately two predetermined values describing respectively that the node is "member even head" or "affiliated". Thus, step 215 of processing 210 may further include updating said status flag to specify that the device is, until proven otherwise, an affiliated node. In the case where said status indicator attests that the node is a member of a cluster (situation illustrated by the link 124-n in Figure 3), step 123 is implemented as soon as an MS message is developed in 123a. On the other hand, in the case where said status indicator attests that a node is affiliated (as illustrated by the link 124-y in FIG. 3), the processing 120 comprises a step 125 to elaborate an affiliation check MAS message. and triggering the transmission of said message by the first means of communication 13. The purpose of such a message MAS consists in verifying in a subsequent step 126 that the member node having previously responded favorably to the application for affiliation is still a member of the same cluster, that is to say attached to the same node head. As indicated by way of nonlimiting example in FIG. 3, a MAS message prepared and transmitted at 125 advantageously comprises two fields MAS-1 and MAS-2 for respectively encoding the value of the identifier IDm of the recipient device of said MAS message. and the value of the identifier IDa of the sharpened device. Such a message MAS could encode as additional field MAS-3 other complementary information IMs. Like the processing 210 which comprises a step 213 waiting to receive a message acknowledging an affiliation request, the processing 120 includes a step 126 waiting to receive a MAA message, acknowledging the message MAS, elaborated and sent by the destination node of the message MAS.
[0022] Indeed, the processing 200 implemented by a device that has previously responded favorably to an affiliation request, may advantageously include a step 202a for decoding a message MAS verification 5 affiliation previously received in 201a by the first communication means . Step 202a may consist of decoding said verification message MAS to deduce the value of the identifier IDa of the source device of the message MAS as well as the value of identifier 10 of the recipient device of said message. When the latter corresponds to the value of the identifier dedicated to said device implementing the processing 200, the latter considers that the message MAS is intended for it. If at 203, the device detects that it is a member of a cluster (situation illustrated by the link 203-a in FIG. 3), the device implements the steps 204 and 205 to develop and then transmit by the first means of communication 13, a MAA message acknowledging the message MAS, like a MAA message developed and issued in response to the receipt of a MAR membership request message to which the device responds favorably. In the opposite case (situation illustrated by the link 203-b in FIG. 3), the device remains mute in 207. The processing 200 stops. On the affiliated device side, a maximum waiting time in step 126 of such a MAA message can be parameterized or determined so that at the end of a given time, the affiliated device considers (symbolized situation by the link referenced 126-n in Figure 3) 30 it is no longer affiliated with the cluster. Processing 120 is thus interrupted in step 129. The device becomes a free node again. Such a step 129 may consist in particular of erasing the register RH. It may further consist in immersing the device in sleep or standby for a given time period according to a WOR technique for example.
[0023] The invention provides, alternatively or in addition, that a MAAR loss of affiliation message can be developed and issued by a communicating electronic device instead of a "silence" or a non-emission of a MAA message, in response to receiving an affiliation checking MAS message when the recipient of said MAS message is no longer a member of a cluster. For this, such a device can, in step 207, develop a MAAR loss of affiliation message and trigger the transmission by the first communication means. Such a MAAR message preparation may consist in encoding: the value of the identifier IDa as a destination device identifier value of the MAAR message; the value of the identifier IDm of the device as a source device identifier value of said MAAR message. Such a message may comprise, like the other messages MAR, MAA, MAS or MS, additional information typing said message. According to this variant, when during step 126, a MAAR message is received and then decoded, certifying that the value of the identifier of the destination device is equal to that of the identifier IDa of the source device of the message MAS and that the value the source identifier of said MAAR message corresponds to that of the destination device identifier of the message MAS, the processing 120 terminates at 129, as previously described. The previously affiliated device becomes a free node again. When during step 126, a MAA message acknowledging the message MAS is received by the first 35 communication means 13, said MAA message is decoded to deduce in particular the content of the MAA-1, MAA-2 and MAA-3 fields. and thus to know the value of the identifier IDm of the source device of the MAA message, the value of the identifier IDa of the affiliated node and that of the identifier IDHc of the head node of the cluster. Step 126 thus makes it possible to verify (situation symbolized by the link referenced 126-y in FIG. 3) that the affiliated node is indeed the recipient of the MAA message, that the latter has indeed been sent by the member node having responded favorably to the application for affiliation and that the cluster is always attached to the same head. Step 126 can further deduce from the MAA message the value of a capacity, for example encoded in the M7A-5 or MAA-6 field, of the head to provide a particular service. Thus, the invention provides an embodiment for which the affiliated node can confirm or deny that said capacity is sufficient according to pre-established criteria. Step 126 may further include updating the HR register in the data memory 12 to update the current value CHc of said capacity. If not, step 129 is implemented and the affiliated node automatically terminates its affiliation. If the MAA message conforms to the expectations of the affiliated node thus confirming the continuity of the affiliation, the step 123 triggering the issuance of the service message MS is implemented.
[0024] We have seen previously, in connection with the processing 210, that the invention provides that the transmission power of a MAR membership request message can be progressive. Advantageously, it is the same for the transmission of a MAS message. The objective sought by this embodiment is thus to preserve the energy resources of the means 17 of the affiliated device. To implement such a progressivity, the transmission power of a MAS message can be first parameterized by the processing unit to transmit, at short range, said MAS message. A first iteration of step 125 thus consists in setting the transmission power to a floor value P'min. At the end of the maximum waiting time provided in step 126, if no MAS message is received (situation symbolized by the link referenced 126-n in FIG. 3), step 129 is not automatically implemented as for the previous embodiment. Instead, the processing 120 consists in triggering a new iteration of the step 125 and thus emitting the MAS message again with an increased transmission power P'min +. This increase is carried out by the processing unit implementing the processing 120 in a step 127, for example according to a given multiplicative factor or a determined incremental step applied to the floor power P'min. If at the end of the maximum duration provided in step 126, no MAA message is received (situation symbolized by the link referenced 126-n in FIG. 3), the processing 120 can trigger a new iteration of the step 125. One or more iterations of steps 127 and 125 can thus succeed each other as long as no message MAS is received and as long as the power P'min + remains lower than a maximum power P'max of emission of a message MAS (situation symbolized by the link referenced 128-n in FIG. 3). Said iterations cease as soon as 128 the maximum transmission power of a message MAS is reached (situation symbolized by the link referenced 128-y in FIG. 3). In this case, processing 120 stops at 129. The invention further provides that the maximum waiting time provided in step 126 may also be progressive and revised at each iteration in step 127. Moreover, in order to preserve the energy resources, such as the means 17 described in connection with FIG. 2, nodes of a network according to the invention, the latter provides that the relays or first transmissions of messages in particular of affiliation request MAR, MAS verification affiliation, acknowledging MAA reception of previous messages or MS service messages, may be packaged within a communicating electronic device acting as a member node, affiliated or free said network at one or more minimum thresholds (for example, depending on the type of message or, depending on whether said message is relayed or first-transmitted) in connection with the remaining capacity of electrical energy means 17 said communicating electronic device. Thus, in conjunction with FIG. 3, the invention provides that the steps for transmitting a message, that is to say in a nonlimiting manner, the steps 212, 125, 123, 205 or else 208 comprise each or in part a preliminary step of test the remaining energy capacity in relation to the minimum threshold concerned. If said remaining capacity is greater than said threshold, the transmission of the message is triggered. In the opposite case the device implementing an affiliation method according to the invention remains silent. Such an embodiment variant makes it possible, for example, to privilege the transmission of service messages MS with regard to the administration messages MAR, MAS, MAA, of the network.
[0025] Whatever the configuration of a cluster adhesion process P100, said method being in accordance with the invention, a preferred embodiment of a communicating electronic device, such as that described with reference to FIG. consists in recording or downloading in the program memory 14, a computer program P, comprising a plurality of program instructions which, when they are executed or interpreted by the processing unit of said device, causes the implementation said method P100.
[0026] The invention has been described by way of an example of a preferred application in connection with the tracking of containers of goods, solid, fluid or liquid goods, said containers cooperating respectively with communicating electronic devices, such as the device 10. according to FIG. 2, implementing an affiliation method, such as the method P100 illustrated in FIG. 3, said devices each comprising a sensor cooperating with a processing unit to measure and collect a quantity related to the internal environments and or external of said containers. Such devices could be exploited for any other application different from that for transmitting data collected over a long distance link. They could also, alternatively or in addition, provide one or more other services. For this, as mentioned above, the data memory 12 of each device may comprise, not a single HR register dedicated to a particular service S, but a plurality of registers RHn, forming a table, each register being dedicated to a particular service Sn. In this variant, the MAR or MS service request messages would include information enabling the identified Sn service to be identified and concerned by each of said messages. For this, the steps 211, 123a of a P100 affiliation method according to the invention would be particularly suitable for encoding said information to identify the service Sn. In addition, the invention provides that a communicating device can in reception to an affiliation request by means of an MAR message, be affiliated with a plurality of clusters for the same service. Thus, a plurality of RHm registers form a table, each register being dedicated to a particular head. According to this variant, a multi-affiliated device may choose to send an MS service message to one of said heads. Such a choice can be based on the respective abilities of the heads to provide the service, or even, without limitation, on the respective distances of said heads in number of jumps.
[0027] To implement such a multi-affiliation, step 123a to develop a service message can advantageously encode the value of the head identifier best in capacity or closest to the device as identifier value of the recipient of said message on duty. The respective values of the capacities of said heads can indeed be updated, for example, according to the MAA messages received and decoded at the step 126 of the processing 120, as described with reference to FIG. 3. The affiliated device can thus be updated arbitrate between the clusters to which it is affiliated according to various criteria, such as by way of non-limiting examples, the capacity of the head, the distance in number of jumps of said head, etc.
[0028] Furthermore, the invention thus relates to any system comprising a plurality of communicating electronic devices according to the invention. More particularly, the invention relates to any container traceability system on a storage area or a transport platform, said system further comprising a remote entity for collecting and operating MC messages transmitted from one or more of said devices when they act. as a cluster head. Such a system has performance in terms of energy autonomy, robustness and adaptability to operating conditions unmatched and unparalleled compared to those conferred by known solutions, such as, for example, the LEACH process. Indeed, thanks to the invention, the exploitation of cluster heads, since their elections, until the achievement of the action or actions concerned by a specific service, is optimal, preventing any superfluous or inefficient communication within the network or to third parties.

权利要求:
Claims (9)
[0001]
REVENDICATIONS1. A method of affiliation (P100) to a cluster (C1, C2) comprising a plurality of communicating electronic devices (10, 10i, al, ..., a8, bl, ..., b8, ..., j1 ,. .., j5), said method being implemented by a processing unit (11) of a first communicating electronic device (10) further comprising a data memory (12), first communication means (13) providing wireless proximity communication with any other communicating electronic device (10i) located within communication range, said memory (12) and said communication means (13) cooperating with said processing unit (11), the data memory (12) ) storing the value of an identifier (ID, IDm) dedicated to the first communicating electronic device (10) and a register (RH) arranged to include the current value (IDHc) of an identifier (IDH) of a communicating electronic device (d2, h3) acting as a cluster head (C1, C2), said method (P100) characterized in that it comprises: - a step (201) for receiving an affiliation request message (MAR) prepared and issued by a second communicating electronic device (c5, i5) requesting an affiliation to a cluster (Cl, C2), said affiliation request message (MAR) comprising the value of the identifier (IDa) of said second device (c5, i5) requesting an affiliation, - a step (202) for decoding said affiliation request message (MAR) and to deduce the value of said identifier (IDa) of said second device requesting an affiliation; a step (204) for preparing a message (MA) acknowledging the affiliation request consisting in encoding (M7A-1, MAA-2, MA-3) within said message (MA): i. the value of the identifier (ID) of the first device as the source device identifier of said message (MA) acknowledging receipt of the affiliation request, ii. the value of the identifier (IDa) of the second device requesting an affiliation as the recipient device identifier of said message (MA) acknowledging receipt of the affiliation request, iii. the current value (IDHc) of the identifier (IDH) of a third communicating electronic device acting as a cluster head, said value (IDHc) being read in the register (RH), - a step (205) for triggering the transmission by the first means of communication (13) of the message (MA) acknowledging receipt of the application for affiliation.
[0002]
2. Method (P100) according to the preceding claim, wherein the step (204) for preparing a message (MA) acknowledging the affiliation request further comprises encoding (M7A-6, MA-7) a value ( CHcl, CHc2) describing a capacity (CH1, CH2) of the third communicating electronic device (d2, h3) acting as a cluster head (C1, C2) to provide a service, said value being recorded in the register (RH) storing in addition, the current value (IDHc) of the identifier (IDH) of said third communicating electronic device (d2, h3) acting as a cluster head (C1, C2).
[0003]
3. Method (P100) according to any one of the preceding claims, wherein the step (205) for triggering the transmission, by the first communication means (13), message (MA) acknowledging receipt of the application for affiliation is performed only if data (12) stores a (203-a) the register memory (RH) having a current value (IDHc) of an identifier (IDH) of a communicating electronic device (d2, h3 ) acting as a cluster head (C1, C2).
[0004]
4. Method (P100) according to any one of the preceding claims, comprising: - a step for producing (211) an affiliation request message (MAR) consisting in encoding (MAR-1) the value of the identifier ( ID, IDa) of the first device (c5, i5) as an identifier of a device requesting a cluster membership; a step (212) for triggering transmission by the first communication means (13) of said affiliation request message (MAR); - A step (213) for receiving by the communication means (13) a message (MA) developed and issued by a fourth device (10i) acknowledging the request of affiliation request (MAR); a step (214), implemented if and only if (213, 213-y) said message (MAA), acknowledging the affiliation request message (MAR), is received before the expiration of a duration maximum waiting period determined from the issue of said affiliation request message (MAR), for decoding said message (MA) acknowledging the affiliation request message and deduce: i. the value of the identifier (MAA-2, IDa) of the recipient device of said message (MA) acknowledging receipt of an affiliation request; ii. the value of the identifier (MAA-3, IDH) of a fifth communicating electronic device acting as a cluster head to which belongs the fourth source device of said message (MA) acknowledging receipt of an affiliation request; a step (215), implemented if and only if said deduced value (MA-2) of the identifier of the destination device is equal to that of the value of the identifier (ID) of the first device requesting an affiliation, for registering in the register (RH) the value deduced from the identifier (IDH) of the fifth communicating electronic device acting as a cluster head, as a current value (IDHc) of device identifier acting as the head of the cluster.
[0005]
5. Method (P100) according to the preceding claim, wherein: - the step (214) for decoding the message (MA) acknowledging the affiliation request message further comprises deducing (MA-1) said message ( MA) the value of the identifier (IDm) of the fourth communicating electronic device source of said message (MAA); the step (215) for updating the register (RH) furthermore consists in recording therein said derived identifier value as identifier of a communicating electronic device on an ascending road (Ru) separating the first device communicating electronics requesting an affiliation of the fifth communicating electronic device acting as a cluster head.
[0006]
6. Method (P100) according to any one of the preceding claims, comprising a step for developing (123a) and triggering (123), by the first communication means (13), the transmission of a service message (MS ) to a communicating electronic device whose identifier value (IDH) is stored, as the current value (IDHc) of identifier of a communicating electronic device acting as a cluster head, by the register (RH ).
[0007]
7. Method according to claims 5 and 6, comprising: - a step (125) prior to develop and transmit, by the first communication means (13), a message (MAS) verification affiliation, said message encoding: i . the value (MAS-1) of the identifier of the fourth communicating electronic device as identifier of the communicating electronic device to which the affiliation verification message (MAS) is addressed; ii. the value (MAS-2) of the identifier of the first device as identifier of the communicating electronic device source of said affiliation verification message (MAS); a step (126), implemented if and only if a message (MAA) acknowledging receipt of said affiliation verification message is received before the expiry of a maximum waiting time determined from the transmission of the message (MAS) affiliation verification, for decoding said acknowledging message (MA) and inferring: i. the value (MA-2) of the identifier of the recipient device of said message (MA) acknowledging the message (MAS) of verification of affiliation; ii. the value (MA-1) of the identifier of the source device of said message (MA) acknowledging the message (MAS) of verification of affiliation; the steps for developing (123a) and triggering (123) the transmission of a service message (MS) being implemented only if (126-y): - the deduced value (MA-2) of the identifier of the message receiving device (MA) acknowledging the affiliation verification message (MAS) is equal to that of the identifier of the first communicating electronic device; the deduced value (MA-1) of the identifier of the source device of said message (MA) acknowledging the affiliation checking message (MAS) is equal to that of the identifier of the fourth communicating electronic device.
[0008]
Computer program (P) comprising a plurality of program instructions which, when: - previously stored in a program memory (14) of an electronic device (10) further comprising a processing unit ( 11), first communication means (13) providing wireless proximity communication with any other electronic device (10i) within communication range, a data memory (12) recording the value of an identifier (ID) dedicated to device and a register (RH) for comprising the current value of an identifier of a device acting as a cluster head, said memories (12, 14) and said first communication means (13) cooperating with said processing unit (11); - executed or interpreted by said processing unit (11), causes the implementation of an affiliation method (P100) according to any one of the preceding claims.
[0009]
Electronic device (10) comprising a processing unit (11), a data memory (12), a program memory (14), first communication means (13) providing wireless proximity communication with any other device electronics (10i) located in communication range, said memories (12, 14) and first communication means (13) cooperating with said processing unit (11), the data memory (12) having the value of an identifier ( ID) dedicated to the device and a register (RH) for comprising the current value of an identifier of a device acting as a cluster head, said device (10) being characterized in that it comprises in the program memory (14), the instructions of a program (P) according to the preceding claim. System comprising a plurality of communicating electronic devices (10, 10i) according to the preceding claim. 11. System according to the preceding claim comprising a plurality of containers of goods, solid goods, fluids or liquids, said containers cooperating respectively with the communicating electronic devices (10, 10i), the latter each comprising a sensor (15) cooperating with the processing unit (11) for measuring and collecting a quantity related to the internal and / or external environments of said containers.

类似技术:

---

公开号 | 公开日 | 专利标题

---

EP3225052B1|2018-11-07|Method for affiliating a cluster of electronic devices communicating via a wireless network, associated electronic device implementing said method and system

---

EP3167631B1|2019-12-18|Method for joining a cluster of electronic devices communicating via a wireless network, associated electronic device implementing said method and system

---

WO2008139062A2|2008-11-20|Method and device for managing communication channels for data exchange from an aircraft

---

EP3275217B1|2019-01-02|Communication method within a dynamic-depth cluster of communicating electronic devices, communicating electronic device implementing said method and associated system

---

CA2819848A1|2013-12-27|Train and secure determination process of the makeup of such a train

---

Chlipala et al.2004|Deluge: data dissemination for network reprogramming at scale

---

EP3629629A1|2020-04-01|Method of managing roaming by multi-network transfer

---

EP3891959A1|2021-10-13|Gateway for communicating via radio network with at least one node and via a wired network, by means of a blockchain

---

WO2020016499A1|2020-01-23|Method for coordinating a plurality of device management servers

---

FR2836611A1|2003-08-29|Network communication method for distributed software architecture, involves storing asynchronous messages sent by card agent to standard agent or vice-versa in storage unit of network by intermediate agent

---

EP3211841B1|2019-06-26|Method for deciding to relay a copy of a route discovery request in a communication network by broadcast

---

WO2013107975A1|2013-07-25|Wake-on-lan for a device connected to a multi-link network

---

EP3900386A1|2021-10-27|Method for managing a data communication device and device for implementing the method

---

EP2938007A1|2015-10-28|Method for managing a set of communicating objects allowing the propagation of a signal, in particular a wake-up instruction, between said objects

---

FR3066342A1|2018-11-16|SINGULARIZATION OF FRAMES TO BE EMITTED BY A CONNECTED OBJECT AND BLOCKING OF REWARDED FRAMES ON A LOW CONSUMPTION WIRELESS COMMUNICATION NETWORK

---

WO2017215970A1|2017-12-21|Method of disseminating data in a meshed network

---

EP1729459A1|2006-12-06|Method and system for broadcasting interactive multimedia in a room complex, especially a hotel structure, method for optimization therefore and multimedia receiver equipment for that system

---

EP2801235A1|2014-11-12|Method for accessing a transmission channel in a wireless communication network with a contention window

同族专利:

---

公开号 | 公开日

---

JP6458148B2|2019-01-23|

---

AU2015352216A1|2017-06-15|

---

WO2016083745A1|2016-06-02|

---

MA40935A|2017-10-04|

---

PT3225052T|2019-02-13|

---

US9894593B2|2018-02-13|

---

EP3225052A1|2017-10-04|

---

MX2017006874A|2018-03-09|

---

JP2017536772A|2017-12-07|

---

FR3029384B1|2018-01-26|

---

MX371400B|2020-01-29|

---

CN107211255B|2021-06-01|

---

KR101976533B1|2019-05-09|

---

ES2710623T3|2019-04-26|

---

IL252495D0|2017-07-31|

---

US20170273005A1|2017-09-21|

---

CN107211255A|2017-09-26|

---

EP3225052B1|2018-11-07|

---

DK3225052T3|2019-03-04|

---

KR20170089911A|2017-08-04|

---

SG11201704215QA|2017-06-29|

---

RU2670381C1|2018-10-22|

---

IL252495A|2020-05-31|

---

CA2968264A1|2016-06-02|

---

AU2015352216C1|2018-08-16|

---

AU2015352216B2|2018-03-15|

---

BR112017011209A2|2018-02-27|

引用文献:

---

公开号 | 申请日 | 公开日 | 申请人 | 专利标题

---

---

JPH09261151A|1996-03-19|1997-10-03|Pfu Ltd|Board area data collection system|

---

US20030083047A1|2001-10-29|2003-05-01|Garland Phillips|Method and communication network for providing operating information associated with a wireless device|

---

US20050175019A1|2004-02-06|2005-08-11|Tatara Systems, Inc.|Wi-Fi service delivery platform for wholesale service providers|

---

EP1805947A1|2004-09-29|2007-07-11|Telefonaktiebolaget LM Ericsson |Installing a new view of a cluster membership|

---

US7460508B2|2004-12-01|2008-12-02|Telefonaktiebolaget L M Ericsson |Methods for cluster-based multi-party conferencing in ad-hoc networks|

---

US20060215673A1|2005-03-11|2006-09-28|Interdigital Technology Corporation|Mesh network configured to autonomously commission a network and manage the network topology|

---

TWM297104U|2005-03-11|2006-09-01|Interdigital Tech Corp|Mesh network configured to autonomously commission a network and manage the network topology|

---

US7548945B2|2005-04-13|2009-06-16|Nokia Corporation|System, network device, method, and computer program product for active load balancing using clustered nodes as authoritative domain name servers|

---

US8134950B2|2007-04-03|2012-03-13|Harris Corporation|Cluster head election in an ad-hoc network|

---

KR20160140967A|2008-01-02|2016-12-07|시그널 트러스트 포 와이어리스 이노베이션|Method and apparatus for cell reselection|

---

US9176963B2|2008-10-30|2015-11-03|Hewlett-Packard Development Company, L.P.|Managing counters in a distributed file system|

---

WO2010071882A2|2008-12-19|2010-06-24|Watchguard Technologies, Inc.|Cluster architecture for network security processing|

---

US9585108B2|2009-05-04|2017-02-28|Qualcomm Incorporated|Method and apparatus for uplink power control in a multicarrier wireless communication system|

---

US9135409B2|2011-05-18|2015-09-15|Hewlett-Packard Development Company, L.P.|Distributing update information based on validated license information|

---

CN102256215B|2011-07-07|2014-02-19|王兰睿|Method and system for verifying international mobile equipment identity in trunking manner|

---

JP5839041B2|2011-10-13|2016-01-06|富士通株式会社|Node device and communication method|

---

JP5892545B2|2012-03-29|2016-03-23|公立大学法人広島市立大学|Dynamic tiering method in network|

---

WO2014107849A1|2013-01-09|2014-07-17|Broadcom Corporation|System and method to establish and maintain cell cluster|

---

FR3004309B1|2013-04-08|2017-03-24|Thales Sa|DISTRIBUTED METHOD FOR SELECTING A CONFIGURATION IN MOBILE NETWORKS|US10182119B2|2016-04-01|2019-01-15|Hyland Switzerland Sarl|System and methods for facilitating communication among a subset of connections that connect to a web application|

---

DK3336782T3|2016-12-13|2020-06-02|Traxens|METHOD OF GEOGRAPHICAL BASED SELECTION OF RADIO FREQUENCY TAPES|

---

WO2019034307A1|2017-08-14|2019-02-21|Sas Inferency|Door to door multimodal track and trace device|

---

SG11202105846VA|2018-12-06|2021-07-29|Visa Int Service Ass|Proximity device network|

---

CN111294252A|2019-07-29|2020-06-16|展讯半导体有限公司|Cluster test system|

---

CN111314872B|2019-11-28|2021-04-02|深圳供电局有限公司|Power distribution network operation remote assistance method based on Internet of things technology|

法律状态:
2015-11-27| PLFP| Fee payment|Year of fee payment: 2 |

---

2016-06-03| PLSC| Publication of the preliminary search report|Effective date: 20160603 |

---

2016-11-18| PLFP| Fee payment|Year of fee payment: 3 |

---

2017-07-21| CA| Change of address|Effective date: 20170616 |

---

2017-11-10| RM| Correction of a material error|Effective date: 20171005 |

---

2017-11-21| PLFP| Fee payment|Year of fee payment: 4 |

---

2019-11-20| PLFP| Fee payment|Year of fee payment: 6 |

---

2020-02-28| CA| Change of address|Effective date: 20200121 |

---

2020-02-28| CJ| Change in legal form|Effective date: 20200121 |

---

2020-04-03| CL| Concession to grant licences|Name of requester: TRAXENS, FR Effective date: 20200221 |

---

2021-08-06| ST| Notification of lapse|Effective date: 20210705 |

优先权:

---

申请号 | 申请日 | 专利标题

---

FR1461609A|FR3029384B1|2014-11-27|2014-11-27|METHOD OF AFFILIATION TO A CLUSTER OF ELECTRONIC DEVICES COMMUNICATING VIA A WIRELESS NETWORK, ELECTRONIC DEVICE USING SAID METHOD AND SYSTEM THEREOF|

---

FR1461609|2014-11-27|FR1461609A| FR3029384B1|2014-11-27|2014-11-27|METHOD OF AFFILIATION TO A CLUSTER OF ELECTRONIC DEVICES COMMUNICATING VIA A WIRELESS NETWORK, ELECTRONIC DEVICE USING SAID METHOD AND SYSTEM THEREOF|

---

PT15808743T| PT3225052T|2014-11-27|2015-11-26|Method for affiliating a cluster of electronic devices communicating via a wireless network, associated electronic device implementing said method and system|

---

KR1020177017758A| KR101976533B1|2014-11-27|2015-11-26|Method for affiliating a cluster of electronic devices communicating via a wireless network, associated electronic device implementing said method and system|

---

CA2968264A| CA2968264A1|2014-11-27|2015-11-26|Method for affiliating a cluster of electronic devices communicating via a wireless network, associated electronic device implementing said method and system|

---

JP2017528846A| JP6458148B2|2014-11-27|2015-11-26|Method of belonging to a cluster of an electronic device communicating via a wireless network, and related electronic device and system for executing the method|

---

DK15808743.7T| DK3225052T3|2014-11-27|2015-11-26|PROCEDURE FOR CONNECTING A CLUSTER OF ELECTRONIC DEVICES COMMUNICATING THROUGH A WIRELESS NETWORK, ELECTRONIC DEVICE IMPLEMENTING THE PROCEDURE AND RELATED SYSTEM|

---

ES15808743T| ES2710623T3|2014-11-27|2015-11-26|Process of affiliation to a cluster of electronic communication devices through a wireless network, an electronic device that implements said process and associated systems|

---

MX2017006874A| MX371400B|2014-11-27|2015-11-26|Method for affiliating a cluster of electronic devices communicating via a wireless network, associated electronic device implementing said method and system.|

---

BR112017011209-4A| BR112017011209A2|2014-11-27|2015-11-26|method for affiliating a grouping of electronic devices that communicate over a wireless network, associated electronic device that implements said method and system|

---

AU2015352216A| AU2015352216C1|2014-11-27|2015-11-26|Method for affiliating a cluster of electronic devices communicating via a wireless network, associated electronic device implementing said method and system|

---

RU2017122357A| RU2670381C1|2014-11-27|2015-11-26|Method for connecting to a cluster of electronic devices exchanging data through the wireless network, a relevant electronic device carrying out the remote method and the relevant system|

---

SG11201704215QA| SG11201704215QA|2014-11-27|2015-11-26|Method for affiliating a cluster of electronic devices communicating via a wireless network, associated electronic device implementing said method and system|

---

EP15808743.7A| EP3225052B1|2014-11-27|2015-11-26|Method for affiliating a cluster of electronic devices communicating via a wireless network, associated electronic device implementing said method and system|

---

MA040935A| MA40935A|2014-11-27|2015-11-26|PROCESS FOR MEMBERSHIP WITH A GROUP OF ELECTRONIC DEVICES COMMUNICATING VIA A WIRELESS NETWORK, ELECTRONIC DEVICE IMPLEMENTING THIS ASSOCIATED PROCESS AND SYSTEM|

---

PCT/FR2015/053222| WO2016083745A1|2014-11-27|2015-11-26|Method for affiliating a cluster of electronic devices communicating via a wireless network, associated electronic device implementing said method and system|

---

CN201580074717.3A| CN107211255B|2014-11-27|2015-11-26|Method for joining a cluster of electronic devices communicating via a wireless network, electronic device implementing the method and related system|

---

IL252495A| IL252495A|2014-11-27|2017-05-24|Method for affiliating a cluster of electronic devices communicating via a wireless network, associated electronic device implementing said method and system|

---

US15/606,815| US9894593B2|2014-11-27|2017-05-26|Method for affiliating a cluster of electronic devices communicating via a wireless network, associated electronic device implementing said method and system|